1955B - Progressive Square - CodeForces Solution


constructive algorithms data structures implementation sortings

Please click on ads to support us..

Python Code:

from collections import Counter

for t in range(int(input())):
    n, c, d = map(int, input().split())
    b = Counter(map(int, input().split()))
    r = True
    a1 = min(b)
    for i in range(n):
        for j in range(n):
            x = a1 + i * c + j * d
            if b[x] == 0:
                r = False
                break
            b[x] -= 1
    if r:
        print("YES")
    else:
        print("NO")


Comments

Submit
0 Comments
More Questions

550C - Divisibility by Eight
5A - Chat Servers Outgoing Traffic
615A - Bulbs
5B - Center Alignment
549A - Face Detection
535B - Tavas and SaDDas
722C - Destroying Array
366A - Dima and Guards
716B - Complete the Word
1461C - Random Events
1627A - Not Shading
141B - Hopscotch
47B - Coins
1466C - Canine poetry
74A - Room Leader
1333D - Challenges in school №41
1475B - New Year's Number
461A - Appleman and Toastman
320B - Ping-Pong (Easy Version)
948A - Protect Sheep
387A - George and Sleep
53A - Autocomplete
1729G - Cut Substrings
805B - 3-palindrome
805C - Find Amir
676C - Vasya and String
1042B - Vitamins
1729F - Kirei and the Linear Function
25D - Roads not only in Berland
1694A - Creep